Linear algorithms for recognizing and parsing superpositional graphs
نویسندگان
چکیده
منابع مشابه
Linear algorithms for recognizing and parsing superpositional graphs
Structurally synthesized binary decision diagrams (SSBDD) are a special type of BDDs that are generated by superposition according to the structure of propositional formula. Fast algorithms for simulation, diagnostic reasoning and test generation running on SSBDDs exploit their specific properties. Hence the correctness of SSBDDs should be checked before using those algorithms. The problem of r...
متن کاملLinear-time certifying algorithms for recognizing trivially perfect graphs
We give the first linear-time certifying algorithms to recognize trivially perfect graphs, with sublinear certificates for negative output. In case of membership in the class of trivially perfect graphs, our algorithms provide as certificate a structure for the input graph that characterizes the class, and in case of non-membership they provide as certificate a forbidden induced subgraph of the...
متن کاملLinear-time certifying algorithms for recognizing split graphs and related graph classes∗
We give the first linear-time certifying algorithms to recognize split graphs, threshold graphs, bipartite chain graphs, cobipartite chain graphs and trivially perfect graphs, with sublinear certificates for negative output. In case of membership in a given graph class our algorithms provide as certificate a structure for the input graph that characterizes the class, and in case of non-membersh...
متن کاملParameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs
We consider the recognition problem for two graph classes that generalize split and unipolar graphs, respectively. First, we consider the recognizability of graphs that admit a monopolar partition: a partition of the vertex set into sets A,B such that G[A] is a disjoint union of cliques and G[B] an independent set. If in such a partition G[A] is a single clique, then G is a split graph. We show...
متن کاملNC Algorithms for Recognizing Chordal Graphs and k Trees
We present parallel algorithms for recognizing the chordal graphs and k trees. Under the model of computation PRAM with concurrent reading and writing allowed, these algorithms take O(log n) time and require O(n4) processors. Our algorithms have an improved processor-bound than an independent result by Edenbrandt for recognizing chordal graphs in parallel using O(n3m) processors. Furthermore, o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Facta universitatis - series: Electronics and Energetics
سال: 2011
ISSN: 0353-3670,2217-5997
DOI: 10.2298/fuee1103325p